- loglog
- loglog /logˈlog/nounThe logarithm of a logarithm (also lōˈlog)
Useful english dictionary. 2012.
loglog
Look at other dictionaries:
Wiener process — In mathematics, the Wiener process is a continuous time stochastic process named in honor of Norbert Wiener. It is often called Brownian motion, after Robert Brown. It is one of the best known Lévy processes (càdlàg stochastic processes with… … Wikipedia
Pairing heap — Pairing heaps are a type of heap data structure with relatively simple implementation and excellent practical amortized performance. However, it has proven very difficult to determine the precise asymptotic running time of pairing heaps.Pairing… … Wikipedia
Logbon — Island is an island in the province of Romblon in the Philippines. It has one barangay named Logbon, Romblon, Romblon. Logbon is derived from a Romblon word Loglog meaning a native long Bolo . The island s shape is slender and elongated that it… … Wikipedia
Fürer's algorithm — is an integer multiplication algorithm for very large numbers possessing a very low asymptotic complexity. It was created in 2007 by Martin Fürer of Pennsylvania State UniversityFuhrer, M. (2007). Faster Integer Multiplication in Proceedings of… … Wikipedia
Brun sieve — In the field of number theory, the Brun sieve (also called Brun s pure sieve) is a technique for estimating the size of sifted sets of positive integers which satisfy a set of conditions which are expressed by congruences. It was developed by… … Wikipedia
1 E19 s and more — To help compare orders of magnitude of different times, this page lists times longer than 1019 seconds (317 billion years). See also Heat death of the universe .Some radioisotopes have extremely long half lives: *(1.4 ± 0.4) times; 1017 years… … Wikipedia
Generalized Riemann hypothesis — The Riemann hypothesis is one of the most important conjectures in mathematics. It is a statement about the zeros of the Riemann zeta function. Various geometrical and arithmetical objects can be described by so called global L functions, which… … Wikipedia
Orders of magnitude (time) — Contents 1 Seconds 2 See also 3 Years 4 See also 5 Footnotes … Wikipedia
Egyptian fraction — An Egyptian fraction is the sum of distinct unit fractions, such as frac{1}{2}+ frac{1}{3}+ frac{1}{16}. That is, each fraction in the expression has a numerator equal to 1 and a denominator that is a positive integer, and all the denominators… … Wikipedia
Almost prime — In number theory, a natural number is called k almost prime if and only if it has exactly k prime factors, counted with multiplicity. More formally, a number n is k almost prime if and only if Ω( n ) = k , where Ω( n ) is the total number of… … Wikipedia
